Multi-objective casting production scheduling problem by a neighborhood structure enhanced discrete NSGA-II: an application from real-world workshop

نویسندگان

چکیده

Casting production scheduling problem has attracted increasing research attention in recent years to facilitate the profits, efficiency, and environment issues of casting industry. is often characterized by properties intensive energy consumption complex process routes, which motivate in-depth investigation on construction practical multi-objective models development effective algorithms. In this paper, for first time, (MOCPSP) constructed simultaneously minimize objectives defective rate, makespan, total consumption. Moreover, a neighborhood structure enhanced discrete NSGA-II (N-NSGA-II) designed better cope with proposed MOCPSP. N-NSGA-II, advantage selection mechanism fully utilized selecting non-dominate solution, three structures are elaborately strengthen ability local search, novel solution generating approach increase diversity solutions global search. Finally, real-world case illustrated evaluate performance N-NSGA-II. Computational results show that N-NSGA-II obtains wider range non-dominated quality compared other well-known

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A multi-objective mathematical model for production-distribution scheduling problem

With increasing competition in the business world and the emergence and development of new technologies, many companies have turned to integrated production and distribution for timely production and delivery at the lowest cost of production and distribution and with the least delay in delivery. By increasing human population and the increase in greenhouse gas emissions and industrial waste, in...

متن کامل

Multi-Objective Scheduling Problem in a Three-Stage Production System

A three stage production system is considered in this paper. There are two stages to fabricate and ready the parts and an assembly stage to assembly the parts and complete the products in this system. Suppose that a number of products of different kinds are ordered. Each product is assembled with a set of several parts. At first the parts are produced in the first stage with parallel machines a...

متن کامل

solution of security constrained unit commitment problem by a new multi-objective optimization method

چکیده-پخش بار بهینه به عنوان یکی از ابزار زیر بنایی برای تحلیل سیستم های قدرت پیچیده ،برای مدت طولانی مورد بررسی قرار گرفته است.پخش بار بهینه توابع هدف یک سیستم قدرت از جمله تابع هزینه سوخت ،آلودگی ،تلفات را بهینه می کند،و هم زمان قیود سیستم قدرت را نیز برآورده می کند.در کلی ترین حالتopf یک مساله بهینه سازی غیر خطی ،غیر محدب،مقیاس بزرگ،و ایستا می باشد که می تواند شامل متغیرهای کنترلی پیوسته و گ...

Solving a bi-objective location routing problem by a NSGA-II combined with clustering approach: application in waste collection problem

It is observed that the separated design of location for depots and routing for servicing customers often reach a suboptimal solution. So, solving location and routing problem simultaneously could achieve better results. In this paper, waste collection problem is considered with regard to economic and societal objective functions. A non-dominated sorting genetic algorithm (NSGA-II) is used to l...

متن کامل

Optimizing a bi-objective preemptive multi-mode resource constrained project scheduling problem: NSGA-II and MOICA algorithms

The aim of a multi-mode resource-constrained project scheduling problem (MRCPSP) is to assign resource(s) with the restricted capacity to an execution mode of activities by considering relationship constraints, to achieve pre-determined objective(s). These goals vary with managers or decision makers of any organization who should determine suitable objective(s) considering organization strategi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Soft Computing

سال: 2022

ISSN: ['1433-7479', '1432-7643']

DOI: https://doi.org/10.1007/s00500-021-06697-y